Method, system and program product for rewriting structured query language (sql) statements

ABSTRACT

A method and system for rewriting Structured Query Language (SQL) statements. A SQL statement having search criteria including conditions pertaining to fields in database tables is received. A table from the SQL statement listing all combinations of the search criteria is created, every combination reflecting a subset of information used to determine combined results. A set of patterns among the possible combinations of the SQL statement based on the fields referenced in the combinations is identified. The table based on the set of patterns is sorted. Based on the sorting, the table is divided into temporary tables which are joined with the SQL statement. New temporary tables are generated. Each new temporary table includes results of a search conducted using a separate portion of the SQL statement as joined with the set of temporary tables. All results from the new temporary tables are combined into a single result table.

This application is a continuation application claiming priority to Ser.No. 10/987,346, filed Nov. 12, 2004.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention generally relates to SQL statements. Specifically,the present invention relates to a method, system and program productfor rewriting SQL statements.

2. Related Art

Structured query language (SQL) is a standard interactive andprogramming language for getting information to and from a database.Although SQL is both an ANSI and an ISO standard, many database productssupport SQL with proprietary extensions to the standard language.Queries take the form of a command language that allows a user toselect, insert, update and find the location of data. In a typicalimplementation, a user will assemble and submit an SQL statement thatspecifies search criteria. In general, the search criteria includes“search objects” and “search expressions” (e.g., Boolean expressions).For example, if a user wishes to locate all purchase orders within adatabase having the country code “DE” (e.g., for Germany), OR having oneor the customers numbers “001, “002” or “003,” the country code and thecustomer numbers would represent the “search objects” portion of thesearch criteria, while the OR would represent the “search expression”portion. As such, the user can assemble a SQL statement such as thefollowing:

SELECT O.customer_po_num FROM bse_order O INNER JOIN cust_order C ON(O.ID = c.order_id and c.order_cust_type = ‘SOLD_TO’) WHERE(O.ISO_COUNTRY_CODE IN (‘DE’) OR (C.CUSTOMER_NUM IN (‘001’,‘002’,‘003’)

Unfortunately, the presence of search expressions such as OR and AND ina SQL statement, cause the query to be extremely slow. This isespecially the case as SQL statements become more complex. Heretofore,no approach has alleviated this burden. That is, no existing approachhas been able to transform or rewrite SQL statements into moremanageable units of work. In view of the foregoing, there exists a needfor a method, system and program product for rewriting SQL statements.Specifically, a need exists whereby the search criteria can be separatedinto smaller units of work or indices that are used to conduct separate,faster searches.

SUMMARY OF THE INVENTION

In general, the present invention provides a method, system and programproduct for rewriting SQL statements. Under the present invention, a SQLstatement having search criteria is received. Upon receipt, a table thatlists all possible combinations of the search criteria is created. Fromthe table, a set of patterns among the possible combinations isidentified. Based on these patterns, the table is then sorted. Oncesorted, the table is divided into a set of temporary tables based on theset of patterns/sorting operation. The set of temporary tables are thenindividually joined with the SQL statement and separate searches areconducted. A new set of temporary tables is then generated and populatedwith results of the separate searches. These result tables are thenunioned/combined into a single result table.

A first aspect of the present invention provides a method for rewritingStructured Query Language (SQL) statements, comprising: receiving a SQLstatement having search criteria; creating a table that lists allpossible combinations of the search criteria; identifying a set ofpatterns among the all possible combinations, and sorting the tablebased on the set of patterns; dividing the table into a set of temporarytables based on the sorting; joining the set of temporary tables withthe SQL statement, and generating a new set of temporary tables thatcontain results of searches conducted using the SQL statement as joinedwith the set of temporary tables; and combining the new set of temporarytables into a single result table.

A second aspect of the present invention provides a system for rewritingStructured Query Language (SQL) statements, comprising: a system forreceiving a SQL statement having search criteria; a system for creatinga table that lists all possible combinations of the search criteria; asystem for identifying a set of patterns among the all possiblecombinations, and sorting the table based on the set of patterns; asystem for dividing the table into a set of temporary tables based onthe set of patterns; a system for joining the set of temporary tableswith the SQL statement, and for generating a new set of temporary tablesthat contain results of searches conducted with the SQL statement asjoined with the set of temporary tables; and a system for combining thenew set of temporary tables into a single result table.

A third aspect of the present invention provides a program productstored on a recordable medium for rewriting Structured Query Language(SQL) statements, which when executed, comprises: program code forreceiving a SQL statement having search criteria; program code forcreating a table that lists all possible combinations of the searchcriteria; program code for identifying a set of patterns among the allpossible combinations, and sorting the table based on the set ofpatterns; program code for dividing the table into a set of temporarytables based on the set of patterns; program code for joining the set oftemporary tables with the SQL statement, and for generating a new set oftemporary tables that contain results of searches conducted with the SQLstatement as joined with the set of temporary tables; and program codefor combining the new set of temporary tables into a single resulttable.

A fourth aspect of the present invention provides a method for deployingan application for rewriting Structured Query Language (SQL) statements,comprising: providing a computer infrastructure being operable to:receive a SQL statement having search criteria; create a table thatlists all possible combinations of the search criteria; identify a setof patterns among the all possible combinations, and sort the tablebased on the set of patterns; divide the table into a set of temporarytables based on the set of patterns; join the set of temporary tableswith the SQL statement, and generate a new set of temporary tables thatcontain results of searches conducted with the SQL statement as joinedwith the set of temporary tables; and combine the new set of temporarytables into a single result table.

A fifth aspect of the present invention provides computer softwareembodied in a propagated signal for rewriting Structured Query Language(SQL) statements, the computer software comprising instructions to causea computer system to perform the following functions: receive a SQLstatement having search criteria; create a table that lists all possiblecombinations of the search criteria; identify a set of patterns amongthe all possible combinations, and sort the table based on the set ofpatterns; divide the table into a set of temporary tables based on theset of patterns; join the set of temporary tables with the SQLstatement, and generate a new set of temporary tables that containresults of searches conducted with the SQL statement as joined with theset of temporary tables; and combine the new set of temporary tablesinto a single result table.

Therefore, the present invention provides a method, system and programproduct for rewriting Structured Query Language (SQL) statements.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other features of this invention will be more readilyunderstood from the following detailed description of the variousaspects of the invention taken in conjunction with the accompanyingdrawings in which:

FIG. 1 depicts a system for rewriting Structured Query Language (SQL)statements according to the present invention.

FIG. 2 depicts a method flow diagram according to the present invention.

The drawings are not necessarily to scale. The drawings are merelyschematic representations, not intended to portray specific parametersof the invention. The drawings are intended to depict only typicalembodiments of the invention, and therefore should not be considered aslimiting the scope of the invention. In the drawings, like numberingrepresents like elements.

DETAILED DESCRIPTION OF THE DRAWINGS

As indicated above, the present invention provides a method, system andprogram product for rewriting SQL statements. Under the presentinvention, a SQL statement having search criteria is received. Uponreceipt, a table that lists all possible combinations of the searchcriteria is created. From the table, a set of patterns among thepossible combinations is identified. Based on these patterns, the tableis then sorted. Once sorted, the table is divided into a set oftemporary tables based on the set of patterns/sorting operation. The setof temporary tables are then individually joined with the SQL statementand separate searches are conducted. A new set of temporary tables isthen generated and populated with results of the separate searches.These result tables are then unioned/combined into a single resulttable.

Referring now to FIG. 1, an illustrative system 10 for rewriting SQLstatements according to the present invention is shown. As depicted,system 10 includes computer system 12, which is intended to representany type of computer system capable of carrying out the teachings of thepresent invention. For example, computer system 12 can be a desktopcomputer, a laptop computer, a workstation, a handheld device, a client,a server, etc. In any event, the teachings of the present invention canbe implemented via a stand-alone system as shown, or over a network suchas the Internet, a local area network (LAN), a wide area network (WAN),a virtual private network (VPN), etc. In the case of the latter,communication throughout the network could occur via a direct hardwiredconnection (e.g., serial port), or via an addressable connection thatmay utilize any combination of wireline and/or wireless transmissionmethods. Conventional network connectivity, such as Token Ring,Ethernet, WiFi or other conventional communications standards could beused. Still yet, connectivity could be provided by conventional IP-basedprotocol. In this instance, an Internet service provider could be usedto establish interconnectivity.

As further shown, computer system 12 generally includes processing unit20, memory 22, bus 24, input/output (I/O) interfaces 26, externaldevices/resources 28 and database 30. Processing unit 20 may comprise asingle processing unit, or be distributed across one or more processingunits in one or more locations, e.g., on a client and server. Memory 22may comprise any known type of data storage and/or transmission media,including magnetic media, optical media, random access memory (RAM),read-only memory (ROM), a data cache, a data object, etc. Moreover,similar to processing unit 20, memory 22 may reside at a single physicallocation, comprising one or more types of data storage, or bedistributed across a plurality of physical systems in various forms.

I/O interfaces 26 may comprise any system for exchanging informationto/from an external source. External devices/resources 28 may compriseany known type of external device, including speakers, a CRT, LEDscreen, hand-held device, keyboard, mouse, voice recognition system,speech output system, printer, monitor/display, facsimile, pager, etc.Bus 24 provides a communication link between each of the components incomputer system 12 and likewise may comprise any known type oftransmission link, including electrical, optical, wireless, etc.

Database 30 can be any type of database capable of providing storage forinformation (e.g., data objects 56, etc.) under the present invention.As such, database 30 could include one or more storage devices, such asa magnetic disk drive or an optical disk drive. In another embodiment,database 30 includes data distributed across, for example, a local areanetwork (LAN), wide area network (WAN) or a storage area network (SAN)(not shown). Although not shown, additional components, such as cachememory, communication systems, system software, etc., may beincorporated into computer system 12.

Shown in memory 22 of computer system 12 as one or more program productsis database search engine 32 and statement rewrite system 34. Databasesearch engine 32 can be any type of search engine/system now known orlater developed that is used to search/query databases and the like. Tothis extent, database search engine 32 is able to handle SQL statementsfrom a user 14, and locate specific data objects 56 based thereon. Underthe present invention, database search engine 32 is augmented bystatement rewrite system 34, which can exist as part of database searchengine 32 or it can be provided as a separate component that works inconjunction with database search engine 32 (e.g., a plug-in). As will beexplained in greater detail below, statement rewrite system 34“rewrites” SQL statements received from user 14 so that any searchexpressions (e.g., AND, OR, etc.) contained therein will not unduly slowthe search process. Specifically, as mentioned above, SQL statementsthat contain search expressions such as AND and OR require significantmore time to process than other SQL statements. The present inventionrewrites such statements in a way that considerable processing time issaved.

Assume in an illustrative example that user 14 wishes to locate purchaseorders having a certain “Country Code” and/or certain “Customer Number.”In this case, user 14 will prepare and submit an SQL statementrequesting such information. In general, an SQL statement includescertain search criteria. The search criteria typically include one ormore search objects and one or more search expressions. In thisillustrative example, “Country Code,” and “Customer Number” would beconsidered the search objects. Depending on how user 14 constructs theSQL statement, typical search expressions could include thelogical/Boolean operators of AND, OR, etc. In any event, listed below isan illustrative SQL statement for this example:

SELECT O.customer_po_num FROM bse_order O INNER JOIN cust_order C ON(O.ID = c.order_id and c.order_cust_type = ‘SOLD_TO’) WHERE(O.ISO_COUNTRY_CODE IN (‘DE’) AND C.CUSTOMER_NUM IN(‘0000000010’,‘0000041886’,‘0000198815’)) OR (C.CUSTOMER_NUM IN(‘0000847203’,‘0000075949’,‘0000556048’,‘0000149090’,‘0000847307’,‘0000848084’,‘0000858628’,‘0000863555’,‘0000123456’,‘0000160970’,‘0000160975’,‘0000160978’,‘0000199664’,‘0000026569’, ‘0000020177’,‘0000020178’)) OR (O.ISO_COUNTRY_CODE IN (‘GT’) AND C.CUSTOMER_NUM IN(‘0000052730’)) OR (O.ISO_COUNTRY_CODE IN (‘CA’)  AND C.CUSTOMER_NUM IN(‘0000083916’,‘0000220837’,‘0000347410’,‘0000462909’,‘0000508568’,       ‘0000633641’,‘0000754760’,‘0000765500’)) ORDER BYO.CUSTOMER_PO_NUM ASC FETCH FIRST 10000 ROWS ONLY;

In this SQL statement, user 14 is seeking purchase orders 56 under fourdifferent conditions:

(1) Purchase orders 56 having a “Country Code” of “DE” AND one of thecustomer numbers of ‘0000000010’,‘0000041886’,‘0000198815’; OR

(2) Purchase orders 56 having one of the customer numbers of‘0000847203’,‘0000075949’,‘0000556048’,‘0000149090’,‘0000847307’,‘0000848084’,‘0000858628’,‘0000863555’,‘0000123456’,‘0000160970’,‘0000160975’,‘0000160978’,‘0000199664’,‘0000026569’,‘0000020177’,‘0000020178’; OR

(3) Purchase orders 56 having a “Country Code” of “GT” AND a customernumber of ‘0000052730’; OR

(4) Purchase orders 56 having a “Country Code” of “CA” AND one of thecustomer numbers of ‘0000083916’,‘0000220837’,‘0000347410’,‘0000462909’,‘0000508568’,‘0000633641’,‘0000754760’,‘0000765500.’ As can thus beseen, the above SQL statement has several instances of searchexpressions (e.g., AND and OR). Under the present invention, statementrewrite system 34 will rewrite this SQL statement into smallercomponents that can be more efficiently handled by database searchengine 32. That is, the present invention will rewrite the SQL statementsuch that it can be handled as a set of indices.

To this extent, when user 14 submits the SQL statement, it will bereceived by SQL reception system 36. Upon receipt, table creation system38 will analyze the statement and create a table 48 that lists all ofthe possible combinations of the search criteria. Specifically, table 48will list the various combinations of “Country Codes” and “CustomerNumbers” that are contained within the SQL statement. An example of thetable listing is shown below:

C.CUSTOMER_NUM O.ISO_COUNTRY_CODE ‘0000000010’ ‘DE’ ‘0000041886’ ‘DE’‘0000198815’ ‘DE’ ‘0000847203’ — ‘0000075949’ — ‘0000556048’ —‘0000149090’ — ‘0000847307’ — ‘0000848084’ — ‘0000858628’ — ‘0000863555’— ‘0000123456’ — ‘0000160970’ — ‘0000160975’ — ‘0000160978’ —‘0000199664’ — ‘0000026569’ — ‘0000020177’ — ‘0000020178’ — ‘0000052730’‘GT’ ‘0000083916’ ‘CA’ ‘0000220837’ ‘CA’ ‘0000347410’ ‘CA’ ‘0000462909’‘CA’ ‘0000508568’ ‘CA’ ‘0000633641’ ‘CA’ ‘0000754760’ ‘CA’ ‘0000765500’‘CA’Once table 48 has been created, table sorting system 40 will identify aset (e.g., one or more) of patterns among the possible combinations, andsort the table based thereon. In viewing the content of table 48 aslisted above, table sorting system 40 could identify two patterns forthis illustrative example. Namely, (1) value and dash (e.g., “CustomerNumber” without “Country Code”); and (2) value and value (e.g.,“Customer Number” with “Country Code”). After sorting table 48 based onthese two patterns, table 48 will appear as follows:

C.CUSTOMER_NUM O.ISO_COUNTRY_CODE ‘0000020177’ — ‘0000020178’ —‘0000026569’ — ‘0000075949’ — ‘0000123456’ — ‘0000149090’ — ‘0000160970’— ‘0000160975’ — ‘0000160978’ — ‘0000199664’ — ‘0000556048’ —‘0000847203’ — ‘0000847307’ — ‘0000848084’ — ‘0000858628’ — ‘0000863555’— ‘0000083916’ ‘CA’ ‘0000220837’ ‘CA’ ‘0000347410’ ‘CA’ ‘0000462909’‘CA’ ‘0000508568’ ‘CA’ ‘0000633641’ ‘CA’ ‘0000754760’ ‘CA’ ‘0000765500’‘CA’ ‘0000000010’ ‘DE’ ‘0000041886’ ‘DE’ ‘0000198815’ ‘DE’ ‘0000052730’‘GT’Once table 48 has been sorted in this manner, table division system 42will divide it into a set of temporary tables 50 based on thesorting/set of patterns. In this example, assume that table divisionsystem 42 divides table 48 into two temporary tables 50 (T1 and T2)based on the two patterns. T1 could be occupied by the value and dashentries (“Customer Number” with no “Country Code”), while T2 could beoccupied by the value and value (“Customer Number” with “Country Code”)entries of the sorted table 48 as follows:

WITH T1 (CUSTOMER_NUM) as (VALUES(‘0000020177’),(‘0000020178’),(‘0000026569’),(‘0000075949’),(‘0000123456’),(‘0000149090’),(‘0000160970’),(‘0000160975’),(‘0000160978’),(‘0000199664’),(‘0000556048’),(‘0000847203’),(‘0000847307’),(‘0000848084’),(‘0000858628’),(‘0000863555’)), T2(CUSTOMER_NUM, ISO_COUNTRY_CODE ) as (VALUES(‘0000083916’,‘CA’),(‘0000220837’,‘CA’),(‘0000347410’,‘CA’),(‘0000462909’,‘CA’),(‘0000508568’,‘CA’),(‘0000633641’,‘CA’),(‘0000754760’,‘CA’),(‘0000765500’,‘CA’),(‘0000000010’,‘DE’),(‘0000041886’,‘DE’),(‘0000198815’,‘DE’),(‘0000052730’,‘GT’)),Once these temporary tables 50 have been created, they will individuallybe joined with the original SQL statement by statement joining system44, and processed by database search engine 32. That is, each temporarytable will be individually joined to the original SQL statement and thenpassed to database search engine 32, which will conduct individualsearches based thereon. The joining of tables T1 and T2 is accompaniedwith instructions to populate the results of the searches into a new setof temporary tables 52 (T3 and T4) by statement joining system 44, withT3 containing the results of T1 as joined with the SQL statement, and T4containing the results of T2 as joined with the SQL statement. Thefollowing code is illustrative of these functions as enabled bystatement joining system 44.

T3 (customer_po_num) as ( SELECT O.customer_po_num FROM bse_order OINNER JOIN cust_order C ON (O.ID = c.order_id and c.order_cust_type =‘SOLD_TO’) INNER JOIN t1 ON t1.CUSTOMER_NUM = C.CUSTOMER_NUM), T4(customer_po_num) as ( SELECT O.customer_po_num FROM bse_order O INNERJOIN cust_order C ON (O.ID = c.order_id and c.order_cust_type =‘SOLD_TO’) INNER JOIN t2 ON t2.CUSTOMER_NUM = C.CUSTOMER_NUM andt2.ISO_COUNTRY_CODE = O.ISO_COUNTRY_CODE),Once the new set of temporary tables 52 have been generated (andpopulated), result system 46 will union/combine them into a singleresult table 54 (T5), which can be presented to user 14 who can then weuse primary keys to find the rows to select from the original SQLtables, and add any other filters as follows:

select customer_po_num from t5 ORDER BY O.CUSTOMER_PO_NUM ASC FETCHFIRST 10000 ROWS ONLY;

Referring now to FIG. 2, a method flow diagram 100 according to thepresent invention is shown. As depicted, first step S1 is to receive aSQL statement having search criteria. Second step S2 is to create atable that lists all possible combinations of the search criteria in theSQL statement. Third step S3 is to identify a set of patterns among thepossible combinations, and to sort the table based thereon. Fourth stepS4 is to divide the table into a set of temporary tables based on theset of patterns/sorting. Fifth step S5 is to join the set of temporarytables with the SQL statement, and generate a new set of temporarytables that contain results of searches conducted using the SQLstatements as joined with the set of temporary tables. Sixth step S6 isto combine the new set of temporary tables into a single result table.

It should be appreciated that the present invention could be offered asa business method on a subscription or fee basis. For example, computersystem 12 and/or statement rewrite system 34 could be created,supported, maintained and/or deployed by a service provider that offersthe functions described herein for customers. That is, a serviceprovider could offer to rewrite SQL statements for customers.

It should also be understood that the present invention could berealized in hardware, software, a propagated signal, or any combinationthereof. Any kind of computer/server system(s)—or other apparatusadapted for carrying out the methods described herein—is suited. Atypical combination of hardware and software could be a general purposecomputer system with a computer program that, when loaded and executed,carries out the respective methods described herein. Alternatively, aspecific use computer, containing specialized hardware for carrying outone or more of the functional tasks of the invention, could be utilized.The present invention can also be embedded in a computer program productor a propagated signal, which comprises all the respective featuresenabling the implementation of the methods described herein, andwhich—when loaded in a computer system—is able to carry out thesemethods. Computer program, propagated signal, software program, program,or software, in the present context mean any expression, in anylanguage, code or notation, of a set of instructions intended to cause asystem having an information processing capability to perform aparticular function either directly or after either or both of thefollowing: (a) conversion to another language, code or notation; and/or(b) reproduction in a different material form.

The foregoing description of the preferred embodiments of this inventionhas been presented for purposes of illustration and description. It isnot intended to be exhaustive or to limit the invention to the preciseform disclosed, and obviously, many modifications and variations arepossible. Such modifications and variations that may be apparent to aperson skilled in the art are intended to be included within the scopeof this invention as defined by the accompanying claims. For example,statement rewrite system 34 is shown with a certain configuration ofsub-systems for illustrative purposes only.

1. A method for rewriting Structured Query Language (SQL) statements,the method comprising: a computer receiving a SQL statement havingsearch criteria that pertain to a plurality of fields in a plurality ofdatabase tables; the computer creating a table from the SQL statementthat lists possible combinations of the search criteria in the SQLstatement, every combination reflecting a subset of information used todetermine combined results; the computer identifying a set of patternsamong the possible combinations of the SQL statement based on the fieldsreferenced in the combinations, and sorting the table based on the setof patterns; the computer dividing the table into a set of temporarytables based on the sorting; the computer joining the set of temporarytables with the SQL statement, and generating a new set of temporarytables, each table comprising results of a search conducted using aseparate portion of the SQL statement as joined with the set oftemporary tables; and the computer combining results from the new set oftemporary tables into a single result table.
 2. The method of claim 1,wherein the search criteria comprise a plurality of search objectsjoined by at least one search expression.
 3. The method of claim 2,wherein the at least one search expression comprises a Boolean searchexpression.
 4. The method of claim 1, wherein the joining comprisesindividually joining each of the set of temporary tables with the SQLstatement, and wherein the generating comprises generating a single newtemporary table for each single temporary table joined with the SQLstatement.
 5. The method of claim 4, wherein the joining comprises aninner join.
 6. The method of claim 1, wherein the dividing comprisesdividing the table into a temporary table for each of the set ofpatterns that is identified.
 7. The method of claim 6, wherein thedividing rewrites the SQL statement as separate indices.
 8. The methodof claim 1, further comprising the computer searching the final resulttable.
 9. A computer program product for rewriting Structured QueryLanguage (SQL) statements, the computer program product comprising: acomputer readable tangible storage device; first program instructions toreceive a SQL statement having search criteria that include conditionsthat pertain to a plurality of fields in a plurality of database tables;second program instructions to create a table from the SQL statementthat lists all possible combinations of the search criteria in the SQLstatement, every combination reflecting a subset of information used todetermine combined results; third program instructions to identify a setof patterns among the all possible combinations of the SQL statementbased on the fields referenced in the combinations, and to sort thetable based on the set of patterns; fourth program instructions todivide the table into a set of temporary tables based on the sorting;fifth program instructions to join the set of temporary tables with theSQL statement, and to generate a new set of temporary tables, each tablecomprising results of a search conducted using a separate portion of theSQL statement as joined with the set of temporary tables; and sixthprogram instructions to combine all results from the new set oftemporary tables into a single result table, wherein the first programinstructions, the second program instructions, the third programinstructions, the fourth program instructions, the fifth programinstructions, and the sixth program instructions are stored on thecomputer readable tangible storage device and are configured to beexecuted by a computer.
 10. The computer program product of claim 9,wherein the search criteria comprise a plurality of search objectsjoined by at least one search expression.
 11. The computer programproduct of claim 10, wherein the at least one search expressioncomprises a Boolean search expression.
 12. The computer program productof claim 9, wherein to join comprises to individually join each of theset of temporary tables with the SQL statement, and wherein to generatecomprises to generate a single new temporary table for each singletemporary table joined with the SQL statement.
 13. The computer programproduct of claim 12, wherein to join comprises to perform an inner join.14. The computer program product of claim 9, wherein to divide comprisesto divide the table into a temporary table for each of the set ofpatterns that is identified.
 15. A computer system for rewritingStructured Query Language (SQL) statements, the computer systemcomprising: a processor; a computer readable memory; a computer readabletangible storage device; first program instructions to receive a SQLstatement having search criteria that include conditions that pertain toa plurality of fields in a plurality of database tables; second programinstructions to create a table from the SQL statement that lists allpossible combinations of the search criteria in the SQL statement, everycombination reflecting a subset of information used to determinecombined results; third program instructions to identify a set ofpatterns among the all possible combinations of the SQL statement basedon the fields referenced in the combinations, and to sort the tablebased on the set of patterns; fourth program instructions to divide thetable into a set of temporary tables based on the sorting; fifth programinstructions to join the set of temporary tables with the SQL statement,and to generate a new set of temporary tables, each table comprisingresults of a search conducted using a separate portion of the SQLstatement as joined with the set of temporary tables; and sixth programinstructions to combine all results from the new set of temporary tablesinto a single result table, wherein the first program instructions, thesecond program instructions, the third program instructions, the fourthprogram instructions, the fifth program instructions, and the sixthprogram instructions are stored on the computer readable tangiblestorage device for execution by the processor via the computer readablememory.
 16. The computer system of claim 15, wherein the search criteriacomprise a plurality of search objects joined by at least one searchexpression.
 17. The computer system of claim 16, wherein the at leastone search expression comprises a Boolean search expression.
 18. Thecomputer system of claim 15, wherein to join comprises to individuallyjoin each of the set of temporary tables with the SQL statement, andwherein to generate comprises to generate a single new temporary tablefor each single temporary table joined with the SQL statement.
 19. Thecomputer system of claim 18, wherein to join comprises to perform aninner join.
 20. The computer system of claim 15, wherein to dividecomprises to divide the table into a temporary table for each of the setof patterns that is identified.